On the Rectilinear Convex Layers of a Planar Set
نویسندگان
چکیده
In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n log n) time and O(n) space.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملA Higher Order B-Splines 1-D Finite Element Analysis of Lossy Dispersive Inhomogeneous Planar Layers
In this paper we propose an accurate and fast numerical method to obtain scattering fields from lossy dispersive inhomogeneous planar layers for both TE and TM polarizations. A new method is introduced to analyze lossy Inhomogeneous Planar Layers. In this method by applying spline based Galerkin’s method of moment to scalar wave equation and imposing boundary conditions we obtain reflection and...
متن کاملOn the convex layers of a planar set
Let S be a set of n points in the Euclidean plane. The convex layers of S are the convex polygons obtained by iterating on the following procedure: compute the convex hull of S and remove its vertices from S. This process of peeling a planar point set is central in the study of robust estimators in statistics. It also provides valuable information on the morphology of a set of sites and has pro...
متن کاملGeneral Formulation to Investigate Scattering from Multilayer Lossy Inhomogeneous Metamaterial Planar Structures
This paper presents a general formulation to investigate the scattering from Multilayer Lossy Inhomogeneous Metamaterial Planar Structure (MLIMPS) with arbitrary number of layers and polarization. First, the dominating differential equation of transverse components of electromagnetic fields in each layers derived. Considering the general form of solution of the differential equations and the bo...
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets1
We present an eecient algorithm to compute an optimal rectilinear Steiner tree for extremal point sets. A point set is extremal if every point in it lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used to construct minimum-length connection for multi-terminal nets in homotopic routing in VLSI layout design. The previous best algorithms run in O(k 4 n) ti...
متن کامل